Issues of Wirelength Cost Models in Routing-Constrained FPGAs
نویسندگان
چکیده
Contrary to prevailing consumer conceptions of efficient silicon use, previous research efforts have shown that designing routing-poor FPGAs may yield significant area gains. In this paper we show that conventional wirelength-centric placement tools are unable to deal with the challenges that routing-limited CAD problems present. We believe that this problem is present given today’s architectures and will become more important as devices scale.
منابع مشابه
Genetic Algorithm for FPGA Placement
Field-Programmable Gate Arrays (FPGAs) are flexible circuits that can be (re)configured by the designer. The efficient use of these circuits requires complex CAD tools. One of the steps of the design process for FPGAs is represented by placement. In this paper we present a genetic algorithm for the FPGA placement problem, in particular for the Atmel FPGA circuits. Because of the limited routing...
متن کاملAPR: An Architecture-Driven Metric for Simultaneous Placement and Global Routing for FPGAs
FPGA routing resources typically consist of segments of various lengths. Due to the segmented routing architectures, the traditional measure of wiring cost (wirelength, delay, congestion, etc) based on geometric distance and/or channel density is no longer accurate for FPGAs. Researchers have shown that the number of segments, instead of geometric (Manhattan) distance, traveled by a net is the ...
متن کاملHigh - Performance Routing for Field - Programmable Gate Arrays
The advantages of field-programmable gate arrays (FPGAs) are sometimes eclipsed by a substantial performance penalty due to signal delay through the programmable routing resources. W e propose Q new FPGA routing construction that directly minimizes source-sink signal propagation delay based on a graph generalization of rectilinear Steiner arborescences (i.e., shortest-paths trees with minimum w...
متن کاملUTPlaceF 2.0: A High-Performance Clock-Aware FPGA Placement Engine
Modern field-programmable gate array (FPGA) devices contain complex clock architectures on top of configurable logics. Unlike application specific integrated circuits (ASICs), the physical structure of clock networks in an FPGA is pre-manufactured and cannot be adjusted to different applications. Furthermore, clock routing resources are typically limited for high-utilization designs. Consequent...
متن کاملTiming-Driven Routing for Symmetrical-Array-Based FPGAs yz
Kai Zhu1, Yao-Wen Chang2, and D. F. Wong3 1Triscend Corp., 301 N. Whisman Rd., Mountain View, CA 94043, USA 2Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan 3Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712, USA Abstract In this paper, we present a timing-driven global router for symmetrical-array-based FPGAs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004